A special class of continuous general linear methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.&#10In series-parallel SPN, the completion time distribution...

متن کامل

A special Class of Stochastic PERT Networks

Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...

متن کامل

Comparison between the effects of flipped class and traditional methods of instruction on satisfaction, active participation, and learning level in a continuous medical education course for general practitioners

Background and Aim:  Physicians’ knowledge and capabilities decrease over time; therefore, continuous medical education is important. Flipped class is a blended teaching method that inverts instructional cycle by delivering the educational content by innovative technology out-of-class.  The aim of this study was to determine the effects of flipped class on satisfaction, active participation,...

متن کامل

Convergence of a General Class of Algorithms for Separated Continuous Linear Programs

Separated continuous linear programs (SCLP) are a type of infinite-dimensional linear program which can serve as a useful model for a variety of dynamic network problems where storage is permitted at the nodes. This paper proves the convergence of a general class of algorithms for solving SCLP under certain restrictions on the problem data. This is the first such proof for any nondiscretization...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational & Applied Mathematics

سال: 2012

ISSN: 1807-0302

DOI: 10.1590/s1807-03022012000200003